Second-Order Cone Programming Formulations for Robust Multiclass Classification
نویسندگان
چکیده
Multiclass classification is an important and ongoing research subject in machine learning. Current support vector methods for multiclass classification implicitly assume that the parameters in the optimization problems are known exactly. However, in practice, the parameters have perturbations since they are estimated from the training data, which are usually subject to measurement noise. In this article, we propose linear and nonlinear robust formulations for multiclass classification based on the M-SVM method. The preliminary numerical experiments confirm the robustness of the proposed method.
منابع مشابه
Second Order Cone Programming Formulations for Handling Data with Perturbation
Ordinal regression problem and general multi-class classification problem are important and on-going research subject in machine learning. Support vector ordinal regression machine (SVORM) is an effective method for ordinal regression problem and has been used to deal with general multi-class classification problem. Up to now it is always assumed implicitly that the training data are known exac...
متن کاملSecond Order Cone Programming Approaches for Handling Missing and Uncertain Data
We propose a novel second order cone programming formulation for designing robust classifiers which can handle uncertainty in observations. Similar formulations are also derived for designing regression functions which are robust to uncertainties in the regression setting. The proposed formulations are independent of the underlying distribution, requiring only the existence of second order mome...
متن کاملSecond Order Cone Programming Formulations for Robust Support Vector Ordinal Regression Machine∗
Support vector ordinal regression machine (SVORM) is an effective method for ordinal regression problem. Up to now, the SVORM implicitly assumes the training data to be known exactly. However, in practice, the training data subject to measurement noise. In this paper, we propose a robust version of SVORM. The robustness of the proposed method is validated by our preliminary numerical experiments.
متن کاملSecond Order Cone Programming Formulations for Feature Selection
This paper addresses the issue of feature selection for linear classifiers given the moments of the class conditional densities. The problem is posed as finding a minimal set of features such that the resulting classifier has a low misclassification error. Using a bound on the misclassification error involving the mean and covariance of class conditional densities and minimizing an L1 norm as a...
متن کاملErratum to: Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study
Robust optimization is an important technique to immunize optimization problems against data uncertainty. In the case of a linear program and an ellipsoidal uncertainty set, the robust counterpart turns into a second-order cone program. In this work, we investigate the efficiency of linearizing the second-order cone constraints of the latter. This is done using the optimal linear outer-approxim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Neural computation
دوره 19 1 شماره
صفحات -
تاریخ انتشار 2007